path conditionの例文

例文

1. This inequality is called a " path condition " and must be true for all executions following the same execution path as the current one.
2. An automated theorem prover is then invoked to find values for the input variables " x " and " y " given the complete set of symbolic variable values and path conditions constructed during symbolic execution.
3. As long as the origin is not in the spectrum ( the matrix is invertible ), one obviously satisfies the path condition from the previous paragraph, and as such, the theory implies that ln " T " is well-defined.
4. Since we'd like the program to follow a different execution path on the next run, we take the last path condition encountered, " x " ` " 100000, and negate it, giving " x " = 100000.